Colorful Coverings of Polytopes and Piercing Numbers of Colorful d-Intervals

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complexity of Finding Nearest Colorful Polytopes

Let P1, . . . , Pd+1 ⊂ R be point sets whose convex hulls each contain the origin. Each set represents a color class. The Colorful Carathéodory theorem guarantees the existence of a colorful choice, i.e., a set that contains exactly one point from each color class, whose convex hull also contains the origin. The computational complexity of finding such a colorful choice is still unknown. We stu...

متن کامل

The Colorful Helly Theorem and Colorful Resolutions of Ideals

We demonstrate that the topological Helly theorem and the algebraic Auslander-Buchsbaum may be viewed as different versions of the same phenomenon. Using this correspondence we show how the colorful Helly theorem of I.Barany and its generalizations by G.Kalai and R.Meshulam translates to the algebraic side. Our main results are algebraic generalizations of these translations, which in particula...

متن کامل

Piercing d -Intervals

A (homogeneous) d-interval is a union of d closed intervals in the line. Using topological methods, Tardos and Kaiser proved that for any finite collection of d-intervals that contains no k + 1 pairwise disjoint members, there is a set of O(dk) points that intersects each member of the collection. Here we give a short, elementary proof of this result. A (homogeneous) d-interval is a union of d ...

متن کامل

Colorful Strips

We study the following geometric hypergraph coloring problem: given a planar point set and an integer k, we wish to color the points with k colors so that any axis-aligned strip containing sufficiently many points contains all colors. We show that if the strip contains at least 2k−1 points, such a coloring can always be found. In dimension d, we show that the same holds provided the strip conta...

متن کامل

Colorful Curvature

Nonlinearities provide a neverending challenge to systems and control. We savor linear systems since we have a good understanding of how they behave, and there is much we can do to analyze and predict their performance. As we move away from linearity, we need to scrutinize each nonlinearity that we encounter to assess its benefi t or detriment in terms of what we wish to achieve. The first issu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Combinatorica

سال: 2019

ISSN: 0209-9683,1439-6912

DOI: 10.1007/s00493-018-3891-1